applications of some graph operations in computing some invariants of chemical graphs

Authors

m. tavakoli

f. rahbarnia

abstract

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

full text

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

full text

computing ga4 index of some graph operations

the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v  , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g  u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twogr...

full text

Spectra of Some New Graph Operations and Some New Class of Integral Graphs

In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.

full text

Wiener - Type Invariants of Some Graph Operations ∗

Let d(G, k) be the number of pairs of vertices of a graph G that are at distance k, λ a real number, and Wλ(G) = ∑ k≥1 d(G, k)kλ. Wλ(G) is called the Wiener-type invariant of G associated to real number λ. In this paper, the Wiener-type invariants of some graph operations are computed. As immediate consequences, the formulae for reciprocal Wiener index, Harary index, hyperWiener index and Tratc...

full text

studying the corona product of graphs under some graph invariants

the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of mathematical chemistry

Publisher: university of kashan

ISSN 2228-6489

volume 4

issue 2 2013

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023